Applying Metaheuristic for Time-Dependent Traveling Salesman Problem in Postdisaster
نویسندگان
چکیده
منابع مشابه
An Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملHybrid CW-GA Metaheuristic for the Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is one of the most challenging problems in Logistics and Supply Chain Management. Its relevance in routing planning and distribution has significant impact on reduction of operative costs for all enterprises. However, due to its NP-hard complexity, it is difficult to obtain optimal solutions for TSP instances. This paper describes a hybrid approach based on ...
متن کاملTime-Dependent Traveling Salesman Problem with Multiple Time Windows
The TSP, VRP and OP problems with time constraints have one common sub-problem – the task of finding the minimum route duration for a given order of customers. While much work has been done on routing and scheduling problems with time windows, to this date only few articles considered problems with multiple time windows. Moreover, since the assumption of constant travel time between two locatio...
متن کاملThe Time Dependent Traveling Salesman Planning Problem in Controlled Airspace
The integration of drones into civil airspace is one of the most challenging problems for the automation of the controlled airspace, and the optimization of the drone route is a key step for this process. In this paper, we optimize the route planning of a drone mission that consists of departing from an airport, flying over a set of mission way points and coming back to the initial airport. We ...
متن کاملThe time dependent traveling salesman problem: polyhedra and algorithm
The Time Dependent Traveling Salesman Problem (TDTSP) is a generalization of the classical Traveling Salesman Problem (TSP), where arc costs depend on their position in the tour with respect to the source node. While TSP instances with thousands of vertices can be solved routinely, there are very challenging TDTSP instances with less than 100 vertices. In this work, we study the polytope associ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2021
ISSN: 1875-6883
DOI: 10.2991/ijcis.d.210226.001